-
1 combinatorial embedding
Большой англо-русский и русско-английский словарь > combinatorial embedding
-
2 combinatorial embedding
Математика: комбинаторное вложениеУниверсальный англо-русский словарь > combinatorial embedding
-
3 combinatorial embedding
English-Russian scientific dictionary > combinatorial embedding
-
4 embedding
1) вложение, вставка2) внедрение3) встраивание4) заделывание, заделка5) вдавливание; утапливание• -
5 algorithm
-
ad hoc algorithm
-
adaptive algorithm
-
aim algorithm
-
best-route algorithm
-
branch-and-bound algorithm
-
branching algorithm
-
chain algorithm
-
coding algorithm
-
collision fronts algorithm
-
combinatorial algorithm
-
computational algorithm
-
construction algorithms
- contour following algorithm -
contour matching algorithm
-
control algorithm
-
curve-fitting algorithm
-
decoding algorithm
-
division algorithm
-
docking algorithm
-
edge-tracking algorithm
-
Euclidian algorithm
-
exact embedding algorithm
-
exchange algorithm
-
generalized algorithm
-
greedy algorithm
-
hardware algorithm
-
image understanding algorithm
-
itention algorithm
-
layout algorithm
-
learning algorithm
-
logical algorithm
-
logic algorithm
-
look-ahead control algorithm
-
LOS approach algorithm
-
min-cut algorithm
-
modeling algorithm
-
Monte-Carlo algorithm
-
numerical algorithm
-
obstacle-avoidance algorithm
-
operating algorithm
-
ordering algorithm
-
paging algorithm
-
partitioning algorithm
-
pattern generation algorithm
-
placement algorithm
-
prediction algorithm
-
probabalistic algorithm
-
problem algorithm
-
programming algorithm
-
random-search algorithm
-
recognition algorithm
-
recursive algorithm
-
rendezvous algorithm
-
routing algorithm
-
scheduling algorithm
-
shortest path algorithm
-
shrinking algorithm
-
simplex algorithm
-
software algorithm
-
sorting algorithm
-
stack algorithm
-
steering algorithm
-
stochastic algorithm
-
testing algorithm
-
transportation algorithm
-
tree-search algorithm
-
velocity compensated algorithm
-
vision algorithm
-
wiring algorithm -
6 dimension
-
7 problem
1) задача; проблема3) трудность, затруднение•- boundary value problem - card matching problem - central limit problem - decision problem under risk - decision problem under uncertainty - extremum problem - fair division problem - gambling problem - gasoline blending problem - incompletely structured problem - optimal path problem - optimal stopping problem - portfolio selection problem - precisely specified problem - recursively solvable problem - sequential decision programming problem - sequential occupancy problem - shortest path problem - shortest route problem - standard control problem - three houses and three wells problem -
8 property
1) свойство; качество; атрибут2) имущество; собственность3) способность•- fixed point property - minimum norm property - property of being atomistic - property of being centered - property of being holomorphic - property of being meromorphic - property of being odd - property of being two-valued - property of being unitary -
9 technique
-
10 theorem
- analytical hierarchy theorem - arithmetical hierarchy theorem - closed range theorem - formally provable theorem - implicit function theorem - initial value theorem - integral representation theorem - local limit theorem - maximal ergodic theorem - mean value theorem - normal form theorem - ratio limit theorem - rational root theorem - second mean value theorem - theorem of consistency proofs - theorem of corresponding states - three line theorem - three series theorem - uniform convergence theorem - uniform ergodic theorem - uniform mean value theoremtheorem implies — из теоремы следует, что…
См. также в других словарях:
Combinatorial species — In combinatorial mathematics, the theory of combinatorial species is an abstract, systematic method for analysing discrete structures in terms of generating functions. Examples of discrete structures are (finite) graphs, permutations, trees, and… … Wikipedia
Graph embedding — In topological graph theory, an embedding of a graph G on a surface Sigma; is a representation of G on Sigma; in which points of Sigma; are associated to vertices and simple arcs (homeomorphic images of [0,1] ) are associated to edges in such a… … Wikipedia
Book embedding — In graph theory, book embedding is a generalization of planar embedding to nonplanar surfaces in the form of a book , a collection of pages (halfplanes) joined together at the spine of the book (the shared boundary of all the halfplanes). The… … Wikipedia
Higman's embedding theorem — In group theory, Higman s embedding theorem states that every finitely generated recursively presented group R can be embedded as a subgroup of some finitely presented group G . This is a result of Graham Higman from the 1960s. [ Graham Higman,… … Wikipedia
Edge coloring — A 3 edge coloring of the Desargues graph. In graph theory, an edge coloring of a graph is an assignment of “colors” to the edges of the graph so that no two adjacent edges have the same color. For example, the figure to the right shows an edge… … Wikipedia
Rotation system — In combinatorial mathematics, rotation systems encode embeddings of graphs onto orientable surfaces, by describing the circular ordering of a graph s edges around each vertex.A more formal definition of a rotation system involves pairs of… … Wikipedia
Cyclic order — In mathematics, a cyclic order is a way to arrange a set of objects in a circle.[nb] Unlike most structures in order theory, a cyclic order cannot be modeled as a binary relation a < b . One does not say that east is more clockwise than west.… … Wikipedia
Planar graph — Example graphs Planar Nonplanar Butterfly graph K5 The complete graph K4 … Wikipedia
Geometric group theory — is an area in mathematics devoted to the study of finitely generated groups via exploring the connections between algebraic properties of such groups and topological and geometric properties of spaces on which these groups act (that is, when the… … Wikipedia
James W. Cannon — (b. January 30, 1943) is an American mathematician working in the areas of low dimensional topology and geometric group theory. He is an Orson Pratt Professor of Mathematics at the Brigham Young University.Biographical dataJames W. Cannon was… … Wikipedia
Small cancellation theory — In the mathematical subject of group theory, small cancellation theory studies groups given by group presentations satisfying small cancellation conditions, that is where defining relations have small overlaps with each other. It turns out that… … Wikipedia
